Efficient Dynamic Optimization of Logic Programs
نویسندگان
چکیده
A summary is given of the dynamicoptimization approach to speedup learning for logic programs. The problem is to restructure a recursive program into an equivalent program whose expected performance is optimal for an unknown but fixed population of problem instances. We define the term "optimal" relative to the source of input instances and sketch an algorithm that can come within a logarithmic factor of optimal with high probability. Finally we show that finding high-utility unfolding operations (such as EBG) can be reduced to clause reordering.
منابع مشابه
Efficient Genetic Based Methods for Optimizing the Reversible and Quantum Logic Circuits
Various synthesis methods have been proposed in the literature for reversible and quantum logic circuits. However, there are few algorithms to optimize an existing circuit with multiple constraints simultaneously. In this paper, some heuristics in genetic algorithms (GA) to optimize a given circuit in terms of quantum cost, number of gates, location of garbage outputs, and delay, are proposed. ...
متن کاملEfficient Genetic Based Methods for Optimizing the Reversible and Quantum Logic Circuits
Various synthesis methods have been proposed in the literature for reversible and quantum logic circuits. However, there are few algorithms to optimize an existing circuit with multiple constraints simultaneously. In this paper, some heuristics in genetic algorithms (GA) to optimize a given circuit in terms of quantum cost, number of gates, location of garbage outputs, and delay, are proposed. ...
متن کاملFlow Analysis of Dynamic Logic Programs
Research on flow analysis and optimization of logic programs typically assumes that the programs being analyzed are static, i.e. any code that can be executed at runtime is available for analysis at compile time. This assumption may not hold for ‘‘real’’ programs, which can contain dynamic goals of the form call(X), where X is a variable at compile time, or where predicates may be modified via ...
متن کاملIntuitionistic fuzzy logic for adaptive energy efficient routing in mobile ad-hoc networks
In recent years, mobile ad-hoc networks have been used widely due to advances in wireless technology. These networks are formed in any environment that is needed without a fixed infrastructure or centralized management. Mobile ad-hoc networks have some characteristics and advantages such as wireless medium access, multi-hop routing, low cost development, dynamic topology and etc. In these netwo...
متن کاملDemand-Driven Indexing of Prolog Clauses
As logic programming applications grow in size, Prolog systems need to efficiently access larger and larger data sets and the need for anyand multiargument indexing becomes more and more profound. Static generation of multiargument indexing is one alternative, but applications often rely on features that are inherently dynamic which makes static techniques inapplicable or inaccurate. Another al...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008